Building Provably Secure Block Ciphers from Cryptographic Hash Functions
نویسندگان
چکیده
منابع مشابه
Provably Secure Cryptographic Hash Functions
The work on this thesis was part of a Study Abroad year at the University of New South Wales, Sydney. It has been a very valuable academic and personal experience, and thanks go to the many people who have supported and inspired me throughout this year. For the support with the work on this thesis, the greatest thanks go to my supervisors Jim Franklin and Richard Buckland. To Jim, for his never...
متن کاملCryptographic Randomness Testing of Block Ciphers and Hash Functions
One of the most basic properties expected from block ciphers and hash functions is passing statistical randomness testing, as they are expected to behave like random mappings. Previously, testing of AES candidate block ciphers was done by concatenating the outputs of the algorithms obtained from various input types. In this work, a more convenient method, namely the cryptographic randomness tes...
متن کاملA Fast Provably Secure Cryptographic Hash Function
We propose a family of fast and provably secure cryptographic hash functions. The security of these functions relies directly on the well-known syndrome decoding problem for linear codes. Attacks on this problem are well identified and their complexity is known. This enables us to study precisely the practical security of the hash functions and propose valid parameters for implementation. Furth...
متن کاملProvably Secure and E cient Block Ciphers
The security and eciency of two recently proposed block ciphers, bear and lion, both based on a hash function and a stream cipher, is discussed. Meet-in-the-middle attacks are presented which can be used to dramatically reduce the complexity of a brute-force key search on both these ciphers. A new block cipher is described which is not susceptible to meet-in-the-middle attacks, is provably secu...
متن کاملProvably Secure One-Way Hash Functions
This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2020
ISSN: 0975-8887
DOI: 10.5120/ijca2020920123